منابع مشابه
Interpolation Theorems on Graph Parameters
For each graph parameter f = f(G) of a graph G, it is said that f interpolates over the set of all graphs with a fixed degree sequence d,R(d) if the following statement holds: If m and M are the minimum and maximum values (respectively) of f(G) over all G ∈ R(d), then for any k, m ≤ k ≤ M, there is a graph G ∈ R(d) such that f(G) = k. In this paper, three graph parameters are shown to be interp...
متن کاملA Note on Closed Graph Theorems
We give a common generalisation of the closed graph theorems of De Wilde and of Popa.
متن کاملSegmentation of Magnetic Resonance Brain Imaging Based on Graph Theory
Introduction: Segmentation of brain images especially from magnetic resonance imaging (MRI) is an essential requirement in medical imaging since the tissues, edges, and boundaries between them are ambiguous and difficult to detect, due to the proximity of the brightness levels of the images. Material and Methods: In this paper, the graph-base...
متن کاملAlgebraic Combinatorics: Spectral Graph Theory, Erdös-Ko-Rado Theorems and Quantum Information Theory
László Babai Symmetry versus regularity Abstract: Symmetry is usually defined in terms of automorphisms; regularity in terms of numerical parameters. Symmetry conditions imply various regularity constraints, but not conversely. We shall discuss two areas of this relationship. First we review some old results by Peter Frankl on how symmetry and regularity constraints affect extremal set systems....
متن کاملNotes on graph theory
2. Introduction 3 2.1. Notations and conventions . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2. Simple graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.3. Drawing graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.4. A first fact: The Ramsey number R (3, 3) = 6 . . . . . . . . . . . . . . 11 2.5. Degrees . . . . . . . . . . . . . . . . . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2016
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-016-1710-2